Edge distance graph kernel and its application to small molecule classification
نویسندگان
چکیده
منابع مشابه
construction and validation of translation metacognitive strategy questionnaire and its application to translation quality
like any other learning activity, translation is a problem solving activity which involves executing parallel cognitive processes. the ability to think about these higher processes, plan, organize, monitor and evaluate the most influential executive cognitive processes is what flavell (1975) called “metacognition” which encompasses raising awareness of mental processes as well as using effectiv...
The Existence Theorem for Contractive Mappings on $wt$-distance in $b$-metric Spaces Endowed with a Graph and its Application
In this paper, we study the existence and uniqueness of fixed points for mappings with respect to a $wt$-distance in $b$-metric spaces endowed with a graph. Our results are significant, since we replace the condition of continuity of mapping with the condition of orbitally $G$-continuity of mapping and we consider $b$-metric spaces with graph instead of $b$-metric spaces, under which can be gen...
متن کاملKernel L1-Minimization: Application to Kernel Sparse Representation Based Classification
The sparse representation based classification (SRC) was initially proposed for face recognition problems. However, SRC was found to excel in a variety of classification tasks. There have been many extensions to SRC, of which group SRC, kernel SRC being the prominent ones. Prior methods in kernel SRC used greedy methods like Orthogonal Matching Pursuit (OMP). It is well known that for solving a...
متن کاملClassification with Kernel Mahalanobis Distance Classifiers
Within the framework of kernel methods, linear data methods have almost completely been extended to their nonlinear counterparts. In this paper, we focus on nonlinear kernel techniques based on the Mahalanobis distance. Two approaches are distinguished here. The first one assumes an invertible covariance operator, while the second one uses a regularized covariance. We discuss conceptual and exp...
متن کاملDistance-Based Topological Indices and Double graph
Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES
سال: 2017
ISSN: 1300-0632,1303-6203
DOI: 10.3906/elk-1603-323